package demo10;

public class BigFileSort {
    // 20 GB = 20 * 1024 * 1024 *1024 Byte
    /**
         add
         bda
         cdas
         quickSort   Space : 0(logn)
         mergeSort need the helper  Space : 0(n)
         use external sort
            divide all of block into subBlock,every subBlock using xMB if x=300

            array1 = 200MB ,and helper =200MB
            array2 = 200MB ,and helper =200MB
            merge sort  array1(200MB) and array2(200MB) and helper =400MB , sum it ,using 200 +200 +400=800 MB
            merge sort   800MB sorted data , and array3(200MB) ,  the helper should be increament ,
            so , the helper get bigger  finally  No!
     @importance answer
so , merge oper ,could be improved ?  can using the  tape disk sort , more slow than memory sort



         like  A.  1-5
               B.  3-6
               C.  5-10
        step1 , merge A and B ,and sort , makeup the AB
        step1 , merge AB and C ,and sort

     */
    public void fileSort(){

    }
}
